Sensitivity of Optimal Capacity to Customer Impatience in an Unobservable M/M/S Queue (Why You Shouldn't Shout at the DMV)
نویسندگان
چکیده
This paper employs sample path arguments to derive the following convexity properties and comparative statics for an M/M/S queue with impatient customers. If the rate at which customers balk and renege is an increasing, concave function of the number of customers in the system (head-count), then the head-count process and the expected rate of lost sales are decreasing and convex in the capacity (service rate or number of servers). This result applies when customers cannot observe the head-count, so that the balking probability is zero and the reneging rate increases linearly with the head-count. Then, the optimal capacity increases with the customer arrival rate but is not monotonic in the reneging rate per customer. When capacity is expensive or the reneging rate is high, the optimal capacity decreases with any further increase in the reneging rate. Therefore managers must understand customers’ impatience to avoid building too much capacity, but customers have an incentive to conceal their impatience, to avoid a degradation in service quality. If the system manager can prevent customers reneging during service (by requiring advance payment or training employees to establish rapport with customers), the system’s convexity properties are qualitatively different but its comparative statics remain the same. Most importantly, the prevention of reneging during service can substantially reduce the total expected cost of lost sales and capacity. It increases the optimal capacity (service rate or number of servers) when capacity is expensive, and reduces the optimal capacity when capacity is cheap.
منابع مشابه
Technical Appendix for: Sensitivity of Optimal Capacity to Customer Impatience in an Unobservable M/M/S Queue (Why You Shouldn’t Shout at the DMV)
function of μ) satisfies sample path convexity (a term that has been introduced by Shaked and Shanthikumar (1988)). Specifically, let 0 ≤ μ1 ≤ μ2 ≤ μ3 ≤ μ4 be four service rates such that μ1 + μ4 = μ2 + μ3, and fix λ, β(·) and η(·). Suppose that there exist Y1, ..., Y4, which are versions of the original head-count processes (Yi has service rate of μi) that satisfy the following two properties ...
متن کاملPerformance Evaluation and Improvement of Queuing System in Iran Khodro Agency, A Case Study
Today, in a competitive market, service organizations and producers have a great attention to optimization and customer satisfaction in order to become competitive. Service organization must reduce the number of arrival, waiting time and service time in the queue to increase the customer satisfaction. In this paper by the aim of queuing theory we analyze the optimal amount of increment in a rep...
متن کاملBat Algorithm for Optimal Service Parameters in an Impatient Customer N-Policy Vacation Queue
In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...
متن کاملAnalysis of an M/G/1 queue with customer impatience and an adaptive arrival process
In this paper we study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival process changes according to whether an incoming customer is impatient or not. We obtain the Laplace-Stieltjes Transform of the joint stationary workload and arrival rate process. This queueing model also captures the interaction between congestion control algorithms and queue manageme...
متن کاملConvexity Properties and Comparative Statics for M/M/S Queues with Balking and Reneging
We use sample path arguments to derive convexity properties of an M/M/S queue with impatient customers that balk and renege. First, assuming that the balking probability and reneging rate are increasing and concave in the total number of customers in the system (head-count), we prove that the expected head-count is convex decreasing in the capacity (service rate). Second, with linear reneging a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Manufacturing & Service Operations Management
دوره 11 شماره
صفحات -
تاریخ انتشار 2009